#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e3+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL ans[maxn],tot=0;
bool vis[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n,k;cin>>n>>k;
    for(LL i=0;i<n+10;i++) vis[i]=0,ans[i]=0;
    tot=0;
    for(LL i=n;i>=1;i--){
        if(i==k) continue;
        else if(!vis[i]){
            ans[++tot]=i;
            vis[max(k-i,(LL)0)]=1;
        }
    }
    cout<<tot<<"\n";
    for(LL i=1;i<=tot;i++){
        cout<<ans[i]<<" ";
    }
    cout<<"\n";
  }
return 0;
}
